The decomposition of triangular numbers

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The generalized triangular decomposition

Given a complex matrix H, we consider the decomposition H = QRP∗, where R is upper triangular and Q and P have orthonormal columns. Special instances of this decomposition include the singular value decomposition (SVD) and the Schur decomposition where R is an upper triangular matrix with the eigenvalues of H on the diagonal. We show that any diagonal for R can be achieved that satisfies Weyl’s...

متن کامل

On the Average of Triangular Numbers

The problem we are dealing with is the following: find two sequences an and bn such that the average of the first bn triangular numbers (starting with the triangular number 1) is still a triangular number, precisely the an-th triangular number. We get also some side results: for instance one of the sequence instrumental to finding the asked for sequences turns out to be a bisection of the seque...

متن کامل

Hierarchical Comprehensive Triangular Decomposition

The concept of comprehensive triangular decomposition (CTD) was first introduced by Chen et al. in their CASC’2007 paper and could be viewed as an analogue of comprehensive Gröbner systems for parametric polynomial systems. The first complete algorithm for computing CTD was also proposed in that paper and implemented in the RegularChains library in Maple. Following our previous work on generic ...

متن کامل

On the Square Roots of Triangular Numbers

1. BALANCING NUMBERS We call an Integer n e Z a balancing number if 1+ 2+ --+ (»l ) = (w + l) + (w + 2) +••• + (» + >•) (1) for some r e Z. Here r is called the balancer corresponding to the balancing number n. For example, 6, 35, and 204 are balancing numbers with balancers 2, 14, and 84, respectively. It follows from (1) that, if n is a balancing number with balancer r, then n2^(n + r)(n + r ...

متن کامل

Comprehensive Triangular Decomposition

We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite partition of the the parameter space into regions, so that within each region the “geometry” (number of irreducible components together with their dimensions and degrees) of the algebraic variety of the specialized system F ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rocky Mountain Journal of Mathematics

سال: 2013

ISSN: 0035-7596

DOI: 10.1216/rmj-2013-43-1-75